On the Complexity of the Generalized Block Distribution

نویسندگان

  • Michelangelo Grigni
  • Fredrik Manne
چکیده

We consider the problem of mapping an array onto a mesh of processors in such a way that locality is preserved. When the computational work associated with the array is distributed in an unstructured way the generalized block distribution has been recognized as an eecient way of achieving an even load balance while at the same time imposing a simple communication pattern. In this paper we consider the problem of computing an optimal generalized block distribution. We show that this problem is NP-complete even for very simple cost functions. We also classify a number of variants of the general problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Fixed Point Attacks on GOST2 Block Cipher

GOST block cipher designed in the 1970s and published in 1989 as the Soviet and Russian standard GOST 28147-89. In order to enhance the security of GOST block cipher after proposing various attacks on it, designers published a modified version of GOST, namely GOST2, in 2015 which has a new key schedule and explicit choice for S-boxes. In this paper, by using three exactly identical portions of ...

متن کامل

Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity

In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...

متن کامل

A generalized ABFT technique using a fault tolerant neural network

In this paper we first show that standard BP algorithm cannot yeild to a uniform information distribution over the neural network architecture. A measure of sensitivity is defined to evaluate fault tolerance of neural network and then we show that the sensitivity of a link is closely related to the amount of information passes through it. Based on this assumption, we prove that the distribu...

متن کامل

On Symmetric Extended Generalized Logistic Distribution

In this paper, we consider a form of the generalized logistic distribution named symmetric extended generalized logistic distribution or extended type III generalized logistic distribution. The distribution is derived by compounding a two-parameter generalized Gumbel distribution with a two-parameter generalized gamma distribution. The cumulative distribution and some properties of this distrib...

متن کامل

On the Distribution Functions of the Range and Quasi-range for the Extended Type I Generalized Logistic Distribution

In this paper, we obtain the distribution functions of the range and the quasi-range of the random variables arising from the extended type I generalized logistic distribution.

متن کامل

Power Function Distribution Characterized by Dual Generalized Order Statistics

The dual generalized order statistics is a unified model which contains the well known decreasingly ordered random data such as (reversed ordered) order statistics and lower record values. In the present paper, some characterization results on the power function distribution based on the properties of dual generalized order statistics are provided. The results are proved without any rest...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996